Advances in Neyman-Pearson Neural Detectors Design

نویسندگان

  • Diego Andina
  • Santiago Torres-Alegre
  • Antonio Vega-Corona
  • Antonio Álvarez-Vellisco
چکیده

This chapter is dedicated to scope of the application of Importance Sampling Techniques to the design phase of Neyman-Pearson Neural Detectors. This phase usually requires the application of MonteCarlo trials in order to estimate some performance parameters. The classical Monte-Carlo method is suitable to estimate high event probabilities but not suitable to estimate very low event probabilities (say, 10−4 or less). For estimations of very low false-alarm probabilities (or error probabilities), a modified Monte-Carlo technique, so-called Importance Sampling (IS) technique, is then considered.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Performance Analysis of Bayesian, Neyman-Pearson and Competitive Neyman-Pearson Voice Activity Detectors

In this paper, the Bayesian, Neyman-Pearson and Competitive Neyman-Pearson detection approaches are analyzed using a perceptually modified Ephraim-Malah (PEM) model, based on which a few practical voice activity detectors are developed. The voice activity detection is treated as a composite hypothesis testing problem with a free parameter formed by the prior signal-to-noise ratio (SNR). It is r...

متن کامل

MLPs for Detecting Radar Targets in Gaussian Clutter

A neural network based coherent detector is proposed for detecting gaussian targets in gaussian clutter. Target and clutter ACF are supposed gaussian with different powers and one lag correlation coefficients. While clutter mean Doppler frequency is set to 1, the influence of target mean Doppler frequency is considered. The neural detector performance is compared to the Neyman-Pearson one. For ...

متن کامل

Distributed signal detection under the Neyman-Pearson criterion

A procedure for finding the Neyman–Pearson optimum distributed sensor detectors for cases with statistically dependent observations is described. This is the first valid procedure we have seen for this case. This procedure is based on a theorem proven in this paper. These results clarify and correct a number of possibly misleading discussions in the existing literature. Cases with networks of s...

متن کامل

Serial Distributed Detection Strategies

In the most common formulation of the binary hypothesis distributed detection problem, local detectors collect statistically independent and identically distributed observations under each hypothesis. Based upon these data, each detector independently decides which hypothesis it judges to be true and then transmits its decision to a fusion center. The fusion center in turn makes a final global ...

متن کامل

Distributed Signal Detection under The

A procedure for nding the Neyman-Pearson optimum distributed sensor detectors for cases with statistically dependent observations is described. This is the rst valid procedure we have seen for this case. This procedure is based on a Theorem proven in this paper. These results clarify and correct a number of possibly misleading discussions in the existing literature. Cases with networks of senso...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003